Admissible transformations and assignment problems
نویسندگان
چکیده
We introduce the notion of admissible transfomations which is related to the Hungarian method for solving assignment problems. Admissible transformations are stated for linear, quadratic and multi-index assignment problems. Their application to find good lower bounds and/or to solve the problem, respectively, is outlined. Finally it is shown that admissible transformations can also be applied to so-called algebraic objective functions whose cost elements are drawn from a totally ordered semigroup.
منابع مشابه
On $F$-Weak Contraction of Generalized Multivalued Integral Type Mappings with $alpha $-admissible
The purpose of this work is to investigate the existence of fixed points of some mappings in fixed point theory by combining some important concepts which are F-weak contractions, multivalued mappings, integral transformations and α-admissible mappings. In fixed point theory, it is important to find fixed points of some classess under F- or F-weak contractions. Also multivalued mappings is the ...
متن کاملA Generalization of a Theorem of Dimensional Analysis
Any function relating several variables for which admissible scale transformations are specified is assumed to satisfy a functional equation that requires admissible transformations of the independent variables to effect only admissible transformations of the dependent variable. When there are not any dimensional constants that, in effect, cancel out the admissible transformations of the indepe...
متن کاملAn Interval Assignment Problem with Multiple Attributes: A DEA-Based Approach
One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...
متن کاملAdmissible Digit Sets and a Modified Stern–Brocot Representation
We examine a special case of admissible representations of the closed interval, namely those which arise via sequences of a finite number of Möbius transformations. We regard certain sets of Möbius transformations as a generalized notion of digits and introduce sufficient conditions that such a “digit set” yields an admissible representation of [0,+∞]. Furthermore we establish the productivity ...
متن کاملFeedback Control of Linear Systems under Input Constraints
This paper shows that the problem of control under linear symmetrical input constraints of linear stabilizable systems can always be solved by restricting the set of admissible initial states to a polyhedral domain of the state space. This result can be obtained by an appropriate closed-loop eigenstructure assignment. Two subsequent problems are then addressed: the maximal size of the domain of...
متن کامل